Rank and Perimeter Preserver of Rank-1 Matrices over Max Algebra
نویسندگان
چکیده
For a rank-1 matrix A = a ⊗ b over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T (A) = U ⊗ A ⊗ V , or T (A) = U ⊗ A ⊗ V with some monomial matrices U and V.
منابع مشابه
On higher rank numerical hulls of normal matrices
In this paper, some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated. A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given. Moreover, using the extreme points of the numerical range, the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$, where $A_1...
متن کاملLinear independence over tropical semirings and beyond
We investigate different notions of linear independence and of matrix rank that are relevant for max-plus or tropical semirings. The factor rank and tropical rank have already received attention, we compare them with the ranks defined in terms of signed tropical determinants or arising from a notion of linear independence introduced by Gondran and Minoux. To do this, we revisit the symmetrizati...
متن کاملOn Some Properties of the Max Algebra System Over Tensors
Recently we generalized the max algebra system to the class of nonnegative tensors. In this paper we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverse of tensors is characterized. Also we generalize the direct product of matrices to the direct product of tensors (of the same order, but may be different dimensions) and i...
متن کاملHow Much Does a Matrix of Rank k Weigh?
Matrices with very few nonzero entries cannot have large rank. On the other hand matrices without any zero entries can have rank as low as 1. These simple observations lead us to our main question. For matrices over finite fields, what is the relationship between the rank of a matrix and the number of nonzero entries in the matrix? This question motivated a summer research project collaboration...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کامل